Grünbaum coloring and its generalization to arbitrary dimension
نویسندگان
چکیده
This paper is a collection of thoughts and observations, being partly a review and partly a report of current research, on recent work in various aspects of Grünbaum colorings, their existence and usage. In particular, one of the most striking significances of Grünbaum’s Conjecture in the 2-dimensional case is its equivalence to the 4-Color Theorem. The notion of Grünbaum coloring is extended from the 2-dimensional case to the case of arbitrary finite hyper-dimensions. S. LAWRENCENKO ET AL. /AUSTRALAS. J. COMBIN. 67 (2) (2017), 119–130 120
منابع مشابه
Relating Embedding and Coloring Properties of Snarks
In 1969, Grünbaum conjectured that snarks do not have polyhedral embeddings into orientable surfaces. To describe the deviation from polyhedrality, we define the defect of a graph and use it to study embeddings of superpositions of cubic graphs into orientable surfaces. Superposition was introduced in [4] to construct snarks with arbitrary large girth. It is shown that snarks constructed in [4]...
متن کاملColor-induced subgraphs of Grünbaum colorings of triangulations of the sphere
A Grünbaum coloring of a triangulation is an assignment of colors to edges so that the edges about each face are assigned unique colors. In this paper we examine the color induced subgraphs given by a Grünbaum coloring of a triangulation and show that the existence of connected color induced subgraphs is equivalent to the Three Color Theorem. A triangulation of an orientable surface is an embed...
متن کاملPolynomial Invariants for Arbitrary Rank D Weakly-Colored Stranded Graphs
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollobás–Riordan polynomials [Math. Ann. 323 (2002), 81–96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored stranded graphs introduced in arXiv:1301.1987. We successfully find in dimension D ≥ 3 a modified Euler characteristic with D − 2 parameters. Using this modified in...
متن کاملA Partially Synchronizing Coloring?
Given a nite directed graph, a coloring of its edges turns the graph into a nite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the automaton at least on k-element subset. A coloring of edges of a directed strongly connected nite graph of a uniform outdegree (constant outdegree of any vertex) is k-...
متن کاملA Helly-type theorem for higher-dimensional transversals
We generalize the Hadwiger(-Danzer-Grünbaum-Klee) theorem on line transversals for an unbounded family of compact convex sets to the case of transversal planes of arbitrary dimension. This is the first Helly-type theorem known for transversals of dimension between 1 and d− 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 67 شماره
صفحات -
تاریخ انتشار 2017